cient Algorithms for Exact Computation of the Loss Curve of Video Sources Christos
نویسندگان
چکیده
The loss curve of a video source characterizes the loss rate of the video stream generated by the source as a function of the allocated bu er size for a given transmission rate. The loss curve is useful in the optimal allocation of resources when the video stream is transmitted over a packet network, so that the desired tradeo can be reached among the loss rate, bandwidth and the bu er space to be allocated in the network. We present a deterministic algorithm for exact computation of the entire loss curve of a video elementary stream. The algorithm exploits the piecewise linearity of the loss curve and computes only the points at which the slope of the loss curve changes. We also present an extension of the algorithm to MPEG-2 Transport Streams. The algorithm was able to compute the entire loss curve of a 2-hour video elementary stream in approximately 11 seconds on a Sun Ultra-2 workstation. The e ciency of the algorithm makes it suitable for both o and on-line QoS provisioning in networked video environments.
منابع مشابه
cient Algorithms for Exact Computation of the Loss Curve of Video Sources
The loss curve of a video source characterizes the loss rate of the video stream generated by the source as a function of the allocated bu er size for a given transmission rate. The loss curve is useful in the optimal allocation of resources when the video stream is transmitted over a packet network, so that the desired tradeo can be reached among the loss rate, bandwidth and the bu er space to...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملcient and Accurate B - rep Generation of Low Degree Sculptured Solids Using Exact Arithmetic : II - Computation
We present e cient algorithms for exact boundary computation on low degree sculptured CSG solids using exact arithmetic. These include algorithms for computing the intersection curves of low-degree trimmed parametric surfaces, decomposing them into multiple components for e cient point location queries inside the trimmed regions, and computing the boundary of the resulting solid using topologic...
متن کاملEecient and Accurate B-rep Generation of Low Degree Sculptured Solids Using Exact Arithmetic:ii - Computation
We present e cient algorithms for exact boundary computation on low degree sculptured CSG solids using exact arithmetic. These include algorithms for computing the intersection curves of low-degree trimmed parametric surfaces, decomposing them into multiple components for e cient point location queries inside the trimmed regions, and computing the boundary of the resulting solid using topologic...
متن کاملE cient and Accurate B-rep Generation of Low Degree Sculptured Solids using Exact Arithmetic
We present e cient representations and algorithms for exact boundary computation on low degree sculptured CSG solids using exact arithmetic. Most of the previous work using exact arithmetic has been restricted to polyhedral models. In this paper, we generalize it to higher order objects, whose boundaries are composed of rational parametric surfaces. The use of exact arithmetic and representatio...
متن کامل